Tight Lower Bounds on the Size of Sweeping Automata
نویسنده
چکیده
A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. We say that a sweeping automaton is degenerate if the automaton has no left-moving transitions. We show that for each positive integer n, there is a nondeterministic finite automaton An over a two-letter alphabet such that An has n states, whereas the smallest equivalent nondegenerate sweeping automaton has 2 states. © 2001 Elsevier Science (USA)
منابع مشابه
A Technique for Proving Lower Bounds on the Size of Sweeping Automata
A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. Sipser [12] has proved that one-way nondeterministic finite automata can be exponentially more succinct in sizes than sweeping automata. In this paper, we propose a technique based on the work in [6] for establishing lower bounds on the size of sweeping automata. We show that Sipser’s tech...
متن کاملTight Bounds on the Complexity of Cascaded Decomposition of Automata
In this paper we give exponential upper and lower bounds on the size of the cascaded (Krohn-Rhodes) decomposition of automata. These results are used for giving elementary algorithms for various translations between automata and temporal logic, where the previously-known translations were nonelementary.
متن کاملTight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees
This paper studies lower bounds for arithmetic circuits computing (non-commutative) polynomials. Our conceptual contribution is an exact correspondence between circuits and weighted automata: algebraic branching programs are captured by weighted automata over words, and circuits with unique parse trees by weighted automata over trees. The key notion for understanding the minimisation question o...
متن کاملETH Library Infinite vs. Finite Size-Bounded Randomized Computations
Randomized computations can be very powerful with respect to space complexity, e. g., for logarithmic space, LasVegas is equivalent to nondeterminism. This power depends on the possibility of infinite computations, however, it is an open question if they are necessary. We answer this question for rotating finite automata (rfas) and sweeping finite automata (sfas). We show that LasVegas rfas (sf...
متن کاملTight Bounds for Complementing Parity Automata
We follow a connection between tight determinisation and complementation and establish a complementation procedure from transition-labelled parity automata to transition-labelled nondeterministic Büchi automata. We prove it to be tight up to an O(n) factor, where n is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 63 شماره
صفحات -
تاریخ انتشار 2001